/*https://leetcode.cn/problems/min-cost-climbing-stairs/submissions/564732201/*/
class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int n = cost.size();
        int dp[n+1];
        dp[0] = dp[1] = 0;
        for(int i = 2;i <= n;i++){
            dp[i] = min(dp[i-1] + cost[i-1],dp[i-2] + cost[i-2]);//dp[i-1]表示在爬当前的前一层楼层时，已经花费了多少，cost[i-1]表示，从当前的前一层爬，需要花费多少
        }
    return dp[n];
    }
};